An algorithm to simplify tensor expressions
نویسندگان
چکیده
منابع مشابه
An Algorithm to Simplify Tensor Expressions
The problem of simplifying tensor expressions is addressed in two parts. The first part presents an algorithm designed to put tensor expressions into a canonical form, taking into account the symmetries with respect to index permutations and the renaming of dummy indices. The tensor indices are split into classes and a natural place for them is defined. The canonical form is the closest configu...
متن کاملAn Extension of Path Expressions to Simplify Navigation in Object-Oriented Queries
Path expressions a central ingredient of query languages for object oriented databases are currently used as a purely navigational vehicle We argue that this does not fully exploit their potential expressive power as a tool to specify connections between objects In particular a user should not be required to specify a path to be followed in full but rather should provide enough information so t...
متن کاملAn Algorithm for Transforming XPath Expressions According to Schema Evolution
XML is a de-fact standard format on the Web. In general, schemas of XML documents are continuously updated according to changes in real world. If a schema is updated, then query expressions have to be transformed so that they are “valid” under the updated schema, since the expressions are no longer valid under the updated schema due to the schema update. However, this is not an easy task since ...
متن کاملAn Algorithm for Transformation of Finite Automata to Regular Expressions
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new proof of equivalence of regular expressions and finite automata.
متن کاملAn Approach to Simplify Reversible Logic Circuits
Energy loss is one of the major problems in traditional irreversible circuits. For every bit of information loss kTln2 joules of heat is lost. In order to reduce the energy loss the concept of reversible logic circuits are introduced. Here we have described an algorithm for simplifying the reversible logic circuit and hence reduction of circuit cost and energy. The algorithm considers sub_circu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 1998
ISSN: 0010-4655
DOI: 10.1016/s0010-4655(98)00117-9